A Uni ed Algorithm for Gate Sizing and Clock Skew Optimization to Minimize Sequential Circuit Area

This paper examines the problem of minimizing the area of a synchronous sequential circuit for a given clock period speci cation under the standard-cell paradigm. This is e ected by appropriately selecting a size for each gate in the circuit from a standard-cell library, and by adjusting the delays between the central clock distribution node and individual ipops. Traditional methods treat these two problems separately, which may lead to very sub-optimal solutions in some cases. Experimental results show that by considering the two problems together, it is not only possible to reduce the optimized circuit area, but also to achieve faster clocking frequencies. We also address the problem of making this work applicable to very large synchronous sequential circuits by partitioning these circuits to reduce the computational complexity.